The Automorphism Group of a Coded System
نویسنده
چکیده
We give a general construction of coded systems with an automorphism group isomorphic to Z⊕G where G is any preassigned group which has a “continuous block presentation” (the isomorphism will map the shift to (1, eG)). Several applications are given. In particular, we obtain automorphism groups of coded systems which are abelian, which are finitely generated and one which contains Z[1/2]. We show that any group which occurs as a subgroup of the automorphism group of some subshift with periodic points dense already occurs for some synchronized system.
منابع مشابه
NILPOTENCY AND SOLUBILITY OF GROUPS RELATIVE TO AN AUTOMORPHISM
In this paper we introduce the concept of α-commutator which its definition is based on generalized conjugate classes. With this notion, α-nilpotent groups, α-solvable groups, nilpotency and solvability of groups related to the automorphism are defined. N(G) and S(G) are the set of all nilpotency classes and the set of all solvability classes for the group G with respect to different automorphi...
متن کاملAutomorphism Group of a Possible 2-(121, 16, 2) Symmetric Design
Let D be a symmetric 2-(121, 16, 2) design with the automorphism group of Aut(D). In this paper the order of automorphism of prime order of Aut(D) is studied, and some results are obtained about the number of fixed points of these automorphisms. Also we will show that |Aut(D)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. In addition we prese...
متن کاملOn the nilpotency class of the automorphism group of some finite p-groups
Let $G$ be a $p$-group of order $p^n$ and $Phi$=$Phi(G)$ be the Frattini subgroup of $G$. It is shown that the nilpotency class of $Autf(G)$, the group of all automorphisms of $G$ centralizing $G/ Fr(G)$, takes the maximum value $n-2$ if and only if $G$ is of maximal class. We also determine the nilpotency class of $Autf(G)$ when $G$ is a finite abelian $p$-group.
متن کاملTHE AUTOMORPHISM GROUP OF NON-ABELIAN GROUP OF ORDER p^4
Let G be a finite non-abelian group of order p^4 . In this paper we give a structure theorem for the Sylow p-subgroup, Aut_p(G) , of the automorphism group of G.
متن کاملTHE AUTOMORPHISM GROUP OF FINITE GRAPHS
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
متن کامل